Complexity of commuting Hamiltonians on a square lattice of qubits
نویسنده
چکیده
We consider the computational complexity of Hamiltonians which are sums of commuting terms acting on plaquettes in a square lattice of qubits, and we show that deciding whether the ground state minimizes the energy of each local term individually is in the complexity class NP. That is, if the ground states has this property, this can be proven using a classical certificate which can be efficiently verified on a classical computer. Different to previous results on commuting Hamiltonians, our certificate proves the existence of such a state without giving instructions on how to prepare it.
منابع مشابه
Behavior of O(log n) local commuting hamiltonians
We study the variant of the k-local hamiltonian problem which is a natural generalization of k-CSPs, in which the hamiltonian terms all commute. More specifically, we consider a hamiltonian H = ∑i Hi over n qubits, where each Hi acts non-trivially on O(log n) qubits and all the terms Hi commute, and show the following 1. We show that a specific case of O(log n) local commuting hamiltonians over...
متن کاملComplexity Classification of Two-Qubit Commuting Hamiltonians
We classify two-qubit commuting Hamiltonians in terms of their computational complexity. Suppose one has a two-qubit commuting Hamiltonian H which one can apply to any pair of qubits, starting in a computational basis state. We prove a dichotomy theorem: either this model is efficiently classically simulable or it allows one to sample from probability distributions which cannot be sampled from ...
متن کاملSimulation of many-body interactions by conditional geometric phases
It is shown how to exactly simulate many-body interactions and multiqubit gates by coupling finite dimensional systems, e.g., qubits with a continuous variable. Cyclic evolution in the phase space of such a variable gives rise to a geometric phase, depending on a product of commuting operators. The latter allows one to simulate many-body Hamiltonians and nonlinear Hamiltonians, and to implement...
متن کاملAchieving quantum supremacy with sparse and noisy commuting quantum computations
The class of commuting quantum circuits known as IQP (instantaneous quantum polynomialtime) has been shown to be hard to simulate classically, assuming certain complexity-theoretic conjectures. Here we study the power of IQP circuits in the presence of physically motivated constraints. First, we show that there is a family of sparse IQP circuits that can be implemented on a square lattice of n ...
متن کاملQCMA hardness of ground space connectivity for commuting Hamiltonians
In this work we consider the ground space connectivity problem for commuting local Hamiltonians. The ground space connectivity problem asks whether it is possible to go from one (efficiently preparable) state to another by applying a polynomial length sequence of 2-qubit unitaries while remaining at all times in a state with low energy for a given Hamiltonian H. It was shown in [GS15] that this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Quantum Information & Computation
دوره 11 شماره
صفحات -
تاریخ انتشار 2011